Improved quantum algorithms for the ordered search problem via semidefinite programming

One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for ordered search in terms of a semidefinite program, we find new quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log_{605} N \approx 0.433 log_2 N queries, which improves upon the previously best known exact algorithm.Comment: 8 pages, 4 figure

On Taylor series of functions regular in Gaier regions

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/41617/1/13_2005_Article_BF01899316.pd

Julia Sets of Orthogonal Polynomials

For a probability measure with compact and non-polar support in the complex plane we relate dynamical properties of the associated sequence of orthogonal polynomials {P n } to properties of the support. More precisely we relate the Julia set of P n to the outer boundary of the support, the filled Julia set to the polynomial convex hull K of the support, and the Green’s function associated with P n to the Green’s function for the complement of K

On the order of summability of the Fourier inversion formula

In this article we show that the order of the point value, in the sense of Łojasiewicz, of a tempered distribution and the order of summability of the pointwise Fourier inversion formula are closely related. Assuming that the order of the point values and certain order of growth at infinity are given for a tempered distribution, we estimate the order of summability of the Fourier inversion formula. For Fourier series, and in other cases, it is shown that if the distribution has a distributional point value of order k, then its Fourier series is e.v. Cesàro summable to the distributional point value of order k+1. Conversely, we also show that if the pointwise Fourier inversion formula is e.v. Cesàro summable of order k, then the distribution is the (k+1)-th derivative of a locally integrable function, and the distribution has a distributional point value of order k+2. We also establish connections between orders of summability and local behavior for other Fourier inversion problems